PList-based Divide and Conquer Parallel Programming
نویسندگان
چکیده
منابع مشابه
Task Parallel Skeletons for Divide and Conquer
Algorithmic skeletons intend to simplify parallel programming by providing recurring forms of program structure as predefined components. We present a fully distributed task parallel skeleton for a very general class of divide and conquer algorithms for MIMD machines with distributed memory. This approach is compared to a simple masterworker design. Based on experimental results for different e...
متن کاملComplexity for Parallel Divide - and - Conquer
This paper studies the relationship between parallel computation cost and communication cost for performing divide-and-conquer (D&C) computations on a parallel system of p processors. The parallel computation cost is the maximal number of the D&C nodes that any processor in the parallel system may expand, whereas the communication cost is the total number of cross nodes. A cross node is a node ...
متن کاملCommunication Complexity for Parallel Divide-and-Conquer
This paper studies the relationship between parallel computation cost and communication cost for performing divide-and-conquer (D&C) computations on a parallel system of p processors. The parallel computation cost is the maximal number of the D&C nodes that any processor in the parallel system may expand, whereas the communication cost is the total number of cross nodes. A cross node is a node ...
متن کاملA Fast Parallel Squarer Based on Divide and Conquer
Fast and small squarers are needed in many applications such as image compression A new family of high performance parallel squarers based on the divide and conquer method is reported Our main result was realizing the basis cases of the divide and conquer recursion by using optimized n bit primitive squarers where n is in the range of to This method reduced the gate count and provided shorter c...
متن کاملParallel Divide and Conquer on Meshes
We address the problem of mapping divide-and-conquer programs to mesh connected multicomputers with wormhole or store-and-forward routing. We propose the binomial tree as an eecient model of parallel divide-and-conquer and present two mappings of the binomial tree to the 2D mesh. Our mappings exploit regularity in the communication structure of the divide-and-conquer computation and are also se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of communications software and systems
سال: 2020
ISSN: 1846-6079,1845-6421
DOI: 10.24138/jcomss.v16i2.1029